A Subspace Method for Large-Scale Eigenvalue Optimization
نویسندگان
چکیده
منابع مشابه
A New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems
In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملSolving Large-scale Quadratic Eigenvalue Problems with Hamiltonian Eigenstructure Using a Structure-preserving Krylov Subspace Method
We consider the numerical solution of quadratic eigenproblems with spectra that exhibit Hamiltonian symmetry. We propose to solve such problems by applying a Krylov-Schur-type method based on the symplectic Lanczos process to a structured linearization of the quadratic matrix polynomial. In order to compute interior eigenvalues, we discuss several shift-and-invert operators with Hamiltonian str...
متن کاملAn Algebraic Substructuring Method for Large-Scale Eigenvalue Calculation
This paper is concerned with solving large-scale eigenvalue problems by algebraic substructuring. Algebraic substructuring refers to the process of applying matrix reordering and partitioning algorithms to divide a large sparse matrix into smaller submatrices from which a subset of spectral components are extracted and combined to form approximate solutions to the original problem. Through an a...
متن کاملa new inexact inverse subspace iteration for generalized eigenvalue problems
in this paper, we represent an inexact inverse subspace iteration method for com- puting a few eigenpairs of the generalized eigenvalue problem ax = bx[q. ye and p. zhang, inexact inverse subspace iteration for generalized eigenvalue problems, linear algebra and its application, 434 (2011) 1697-1715 ]. in particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملA Subspace Approximation Method for the Quadratic Eigenvalue Problem
Quadratic eigenvalue problems involving large matrices arise frequently in areas such as the vibration analysis of structures, MEMS simulation, and the solution of quadratically constrained least squares problems. The typical approach is to solve the quadratic eigenvalue problem using a mathematically equivalent linearized formulation, resulting in a doubled dimension and a lack of backward sta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2018
ISSN: 0895-4798,1095-7162
DOI: 10.1137/16m1070025